Symbol-Level GRAND for High-Order Modulation Over Block Fading Channels
نویسندگان
چکیده
Guessing random additive noise decoding (GRAND) is a noise-centric method, which suitable for low-latency communications, as it supports error correction codes that generate short codewords. GRAND estimates transmitted codewords by guessing the patterns altered them during transmission. The process requires testing of are arranged in increasing order Hamming weight. This approach fitting binary transmission over white Gaussian channels. letter considers coded and modulated data block fading channels proposes more computationally efficient variant GRAND, leverages information on modulation scheme channel. In core proposed variant, referred to symbol-level an expression approximately computes probability occurrence pattern determines with tested. Analysis simulation results demonstrate produces faster than original at cost small increase memory requirements.
منابع مشابه
Coded Modulation with Mismatched CSIT over Block-Fading Channels
Reliable communication over delay-constrained block-fading channels with discrete inputs and mismatched (imperfect) channel state information at the transmitter (CSIT) is studied. The CSIT mismatch is modeled as Gaussian random variables, whose variances decay as a power of the signal-to-noise ratio (SNR). A special focus is placed on the large-SNR decay of the outage probability when power con...
متن کاملALOUINI AND GOLDSMITH: ADAPTIVE MODULATION OVER NAKAGAMI FADING CHANNELS 0 Adaptive Modulation over Nakagami Fading Channels
We rst study the capacity of Nakagami multipath fading (NMF) channels with an average power constraint for three power and rate adaptation policies. We obtain closed-form solutions for NMF channel capacity for each power and rate adaptation strategy. Results show that rate adaptation is the key to increasing link spectral eeciency. We analyze therefore the performance of constant-power variable...
متن کاملPerformance Comparison of Symbol- and Bit-Interleaving of Block Codes over GF(2m) on Fading Channels
We analytically compare the word error probabilities of imperfectly symboland bit-interleaved block codes over GF(2m) on fading channels. We employ an approximate fading channel model of a two-state Markov chain, using statistics of the fadeand interfadedurations. The analytical method is based on a technique developed in [2]. Expressions are derived for two decoding strategies; independent bou...
متن کاملOptimal precoder for block transmission over frequency-selective fading channels
The authors consider the design of a precoder for block transmission over a frequencyselective fading channel that minimises the worst-case averaged pairwise error probability (PEP) of the maximum likelihood detector. In applications in which the transmitter does not know the channel, the scaled identity matrix is shown to be an optimal precoder for the general uncorrelated frequency-selective ...
متن کاملBuffer and channel adaptive modulation for transmission over fading channels
We consider the problem of adaptive modulation for increasing the throughput of transmission over fading channels. In the model, packets arrive at a finite-length buffer according to a Poisson distribution and are mapped into M-ary quadrature amplitude modulated (MQAM) symbols for transmission over a correlated Rayleigh fading channel. We assume that buffer and channel state information are alw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2023
ISSN: ['1558-2558', '1089-7798', '2373-7891']
DOI: https://doi.org/10.1109/lcomm.2022.3227593